The sinc–Galerkin method for solving Troesch’s problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولNumerical method for solving optimal control problem of the linear differential systems with inequality constraints
In this paper, an efficient method for solving optimal control problems of the linear differential systems with inequality constraint is proposed. By using new adjustment of hat basis functions and their operational matrices of integration, optimal control problem is reduced to an optimization problem. Also, the error analysis of the proposed method is nvestigated and it is proved that the orde...
متن کاملOn the hybrid conjugate gradient method for solving fuzzy optimization problem
In this paper we consider a constrained optimization problem where the objectives are fuzzy functions (fuzzy-valued functions). Fuzzy constrained Optimization (FO) problem plays an important role in many fields, including mathematics, engineering, statistics and so on. In the other side, in the real situations, it is important to know how may obtain its numerical solution of a given interesting...
متن کاملA New Method for Solving the Fully Interval Bilevel Linear Programming Problem with Equal Constraints
Most research on bilevel linear programming problem is focused on its deterministic form, in which the coefficients and decision variables in the objective functions and constraints are assumed to be crisp. In fact, due to inaccurate information, it is difficult to know exactly values of coefficients that used to construct a bilevel model. The interval set theory is suitable for describing and...
متن کاملParametric Spline Method for Solving Bratu’s Problem
In this paper, parametric spline method is introduced for solving Bratu’s problem. The convergence analysis of the presented method is discussed. The method is illustrated with two numerical examples and the results show that the method converges rapidly and approximates the exact solution very accurately.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2012
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2011.11.071